Verifying Periodic Task-Control Systems
نویسنده
چکیده
This paper deals with the automated veriication of a class of task-control systems with periods, durations, and scheduling specii-cations. Such systems are translated into Periodic Hybrid Automata for veriication. We show that safety, liveness, and time-bounded properties are decidable for the considered systems.
منابع مشابه
Safety Verification of Real Time Systems Serving Periodic Devices
In real-time systems response to a request from a controlled object must be correct and timely. Any late response to a request from such a device might lead to a catastrophy. The possibility of a task overrun, i.e., missing the deadline for completing a requested task, must be checked and removed during the design of such systems. Safe design of real-time systems running periodic tasks under th...
متن کاملEvent-triggered and self-triggered control design with guaranteed performance
In digital control applications, controllers are typically implemented in a time-triggered fashion, in which control tasks are executed periodically. This design choice is motivated by the fact that it enables the use of a well-developed theory on sampled-data systems. This design choice, however, leads to over-utilization of the available communication resources, and/or a limited lifetime of b...
متن کاملPole Assignment Of Linear Discrete-Time Periodic Systems In Specified Discs Through State Feedback
The problem of pole assignment, also known as an eigenvalue assignment, in linear discrete-time periodic systems in discs was solved by a novel method which employs elementary similarity operations. The former methods tried to assign the points inside the unit circle while preserving the stability of the discrete time periodic system. Nevertheless, now we can obtain the location of eigenvalues ...
متن کاملThe NCSU Concurrency
The NCSU Concurrency Workbench is a tool for verifying nite-state systems. A key feature is its exibility; its modular design eases the task of adding new analyses and changing the language users employ for describing systems. This note gives an overview of the sys-tem's features, including its capacity for generating diagnostic information for incorrect systems, and discusses some of its appli...
متن کاملWill Concurrency Theory Help Verifying Multi-agent Systems? { a Case Study {
The veriication of multi agent systems is an important and diicult task. Though much work is spent on veriication in concurrency theory only few results and tools are used in multi-agent systems. In this paper, we investigate how CCS, the calculus for concurrent systems, may contribute to the veriication of multi-agent systems. We review an architecture for a diagnosis agent and show how the to...
متن کامل